منابع مشابه
Assume-Guarantee Synthesis
The classical synthesis problem for reactive systems asks, given a proponent process A and an opponent process B, to refine A so that the closed-loop system A||B satisfies a given specification Φ. The solution of this problem requires the computation of a winning strategy for proponent A in a game against opponent B. We define and study the co-synthesis problem, where the proponent A consists i...
متن کاملAssume-Guarantee Strategy Synthesis for Stochastic Games
This thesis presents a framework for the automatic strategy synthesis fromquantitative specifications, in order to control autonomous systems. Wemodel systems as turn-based two-player zero-sum stochastic games, whichare able to express both stochastic and nondeterministic environmentaluncertainty. Given a system model and a specification, we define thestrategy synthesis prob...
متن کاملAssume-Guarantee Model Checking
We present assume-guarantee model checking, a novel technique for verifying correctness properties of loosely-coupled multithreaded software systems. Assume-guarantee model checking verifies each thread of a multithreaded system separately by constraining the actions of other threads with an automatically inferred environment assumption. Separate verification of each thread allows the enumerati...
متن کاملPattern-Based Refinement of Assume-Guarantee Specifications in Reactive Synthesis
We consider the problem of compositional refinement of components’ specifications in the context of compositional reactive synthesis. Our solution is based on automatic refinement of assumptions and guarantees expressed in linear temporal logic (LTL). We show how behaviors of the environment and the system can be inferred from counterstrategies and strategies, respectively, as formulas in speci...
متن کاملValidity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts
Automated synthesis of reactive systems from specifications has been a topic of research for decades. Recently, a variety of approaches have been proposed to extend synthesis of reactive systems from propositional specifications towards specifications over rich theories. We propose a novel, completely automated approach to program synthesis which reduces the problem to deciding the validity of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.260.2